Accelerated Path Tracing With GAN and Matrix Completion

نویسندگان

چکیده

Denoising-based techniques have recently been shown to be effective for accelerating path tracing rendering methods. However, there remains a problem which is input images need the minimum necessary samples number in order ensure quality of output. In this paper, we propose new accelerated approach with generative adversarial networks(GAN) and matrix completion. Unlike methods based on denoising neural network, randomly render part pixels image, are much less than other Next, utilize trained GAN pre-complete initializing missing pixels. Because accuracy fast-convergence GAN, our pre-completion results more accurate Then, according pre-completion, present pre-completed as low-rank make use completion recovers values accurately even high details. To improve efficiency solving completion, modified original weighted nuclear norm minimization parameter adjustment(PAWNNM) strategy. The result shows better visual quality, texture details convergence state-of-the-art acceleration methods, especially network.

منابع مشابه

An Accelerated Iterative Hard Thresholding Method for Matrix Completion

The matrix completion problem is to reconstruct an unknown matrix with low-rank or approximately low-rank constraints from its partially known samples. Most methods to solve the rank minimization problem are relaxing it to the nuclear norm regularized least squares problem. Recently, there have been some simple and fast algorithms based on hard thresholding operator. In this paper, we propose a...

متن کامل

Accelerated Inexact Soft-Impute for Fast Large-Scale Matrix Completion

A 3 AIS-Impute (proposed algorithm). Require: partially observed matrix O, parameter λ, decay parameter ν ∈ (0, 1), threshold ; 1: [U0, λ0, V0] = rank-1 SVD(PΩ(O)); 2: c = 1, ̃0 = ‖PΩ(O)‖F , X0 = X1 = λ0U0V > 0 ; 3: for t = 1, 2, . . . do 4: ̃t = ν̃0; θt = (c− 1)/(c+ 2); 5: λt = ν(λ0 − λ) + λ; 6: Yt = Xt + θt(Xt −Xt−1); 7: Z̃t = Yt + PΩ(O − Yt); 8: Vt−1 = Vt−1 − Vt(VtVt−1), remove zero columns; ...

متن کامل

Tracing Efficient Path Using Web Path Tracing

In the fast improving society, people depend on online purchase of goods than spending time physically. So there are lots of resources emerged for this online buying and selling of materials. Efficient and attractive web sites would be the best to sell the goods to people. To know whether a web site is reaching the mind of the customers or not, a high speed analysis is done periodically by the ...

متن کامل

Accelerated Beam Tracing Algorithm

Determining early specular reflection paths is essential for room acoustics modeling. Beam tracing algorithms have been used to calculate these paths efficiently, thus allowing modeling of acoustics in real-time with a moving listener in simple, or complex but densely occluded, environments with a stationary sound source. In this paper it is shown that beam tracing algorithms can still be optim...

متن کامل

Graph Matrix Completion in Presence of Outliers

Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3059887